Repair Pipelining for Erasure-coded Storage: Algorithms and Evaluation
نویسندگان
چکیده
We propose repair pipelining , a technique that speeds up the performance in general erasure-coded storage. By carefully scheduling of failed data small-size units across storage nodes pipelined manner, reduces single-block time to approximately same as normal read for single block homogeneous environments. further design different extensions algorithms heterogeneous environments and multi-block operations. implement prototype, called ECPipe integrate it middleware system into two versions Hadoop Distributed File System (HDFS) (namely, HDFS-RAID HDFS-3) well Quantcast System. Experiments on local testbed Amazon EC2 show significantly improves degraded reads full-node recovery over existing techniques.
منابع مشابه
Repair Pipelining for Erasure-Coded Storage
We propose repair pipelining, a technique that speeds up the repair performance in general erasure-coded storage. By pipelining the repair of failed data in small-size units across storage nodes, repair pipelining reduces the repair time to approximately the same as the normal read time to the same amount of data in homogeneous environments. We further extend repair pipelining for heterogeneous...
متن کاملByzantine-tolerant erasure-coded storage
This paper describes a decentralized consistency protocol for survivable storage that exploits data versioning within storage-nodes. Versioning enables the protocol to efficiently provide linearizability and wait-freedom of read and write operations to erasure-coded data in asynchronous environments with Byzantine failures of clients and servers. Exploiting versioning storage-nodes, the protoco...
متن کاملOptimistic Erasure-Coded Distributed Storage
We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic Storage, which consists of two separate implementations, ORCAS-A and ORCAS-B. In terms of storage space used, ORCAS-A is more efficient in s...
متن کاملThe CORE Storage Primitive: Cross-Object Redundancy for Efficient Data Repair & Access in Erasure Coded Storage
Erasure codes are an integral part of many distributed storage systems aimed at Big Data, since they provide high fault-tolerance for low overheads. However, traditional erasure codes are inefficient on reading stored data in degraded environments (when nodes might be unavailable), and on replenishing lost data (vital for long term resilience). Consequently, novel codes optimized to cope with d...
متن کاملErasure-Coded Byzantine Storage with Separate Metadata
Although many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity and the supported level of concurrency, has been elusive for a long time. Combining these properties is difficult, especially if the resulting solution is required to be efficient and incur low cost. We pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Storage
سال: 2021
ISSN: ['1553-3077', '1553-3093']
DOI: https://doi.org/10.1145/3436890